Matrix Rigidity
نویسنده
چکیده
The rigidity of a matrix M is the function R M (r), which, for a given r, gives the minimum number of entries of M which one has to change in order to reduce its rank to at most r. This notion has been introduced by Valiant in 1977 in connection with the complexity of computing linear forms. Despite more than 20 years of research, very little is known about the rigidity of matrices. Nonlinear lower bounds on matrix rigidity would lead to new lower bound techniques for the computation of linear forms, e.g., for the computation of the DFT, as well as to more general advances in complexity theory. We put forward a number of linear algebra research issues arising in the above outlined context.
منابع مشابه
Mechanical Control of Stem Cell Dif- Ferentiation Using Micro-engineered Matrix
In this work, we explore the molecular mechanisms by which local mechanical properties (e.g., rigidity) of the extracellular matrix (ECM) cooperates with soluble cues to regulate lineage commitment of human mesenchymal stem cells (hMSCs). We have established different micropost array substrates that can definitively decouple matrix rigidity from other properties including adhesiveness. We appli...
متن کاملOn the universal rigidity of generic bar frameworks
In this paper, we present a sufficient condition for the universal rigidity of a generic bar framework G(p) in terms of the Gale matrix Z corresponding to G(p). We also establish a relationship between the stress matrix S and the Gale matrix Z for bar frameworks. This allows us to translate back and forth between S and Z in recently obtained results concerning universal rigidity, global rigidit...
متن کاملMatrix Rigidity from the Viewpoint of Parameterized Complexity
The rigidity of a matrix A for a target rank r over a field F is the minimum Hamming distance between A and a matrix of rank at most r. Rigidity is a classical concept in Computational Complexity Theory: constructions of rigid matrices are known to imply lower bounds of significant importance relating to arithmetic circuits. Yet, from the viewpoint of Parameterized Complexity, the study of cent...
متن کاملUniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision, and control. Most recent work has been focused on constructing efficient algorithms for exact or approximate recovery of the missing matrix entries and proving lo...
متن کاملThree lines proof of the lower bound for the matrix rigidity
The rigidity of a matrix describes the minimal number of entries one has to change to reduce matrix’s rank to r. We give very simple combinatorial proof of the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix that matches the best known result by de Wolf(2005) for Hadamard matrices proved by quantum information theoretical arguments.
متن کاملThe Geometry of Matrix Rigidity
Consider the following problem: Given an n×n matrix A and an input x, compute Ax. This problem has a simple algorithm which runs in time O(n). The question thus is: Is this is the best possible ? Valiant showed ([12]) that if an n × n matrix A is rigid, then the smallest straight line program computing Ax is either super-linear size, or has super logarithmic depth. Roughly a matrix of rank n is...
متن کامل